Probabilistic nilpotence in infinite groups
نویسندگان
چکیده
The ‘degree of k-step nilpotence’ a finite group G is the proportion tuples (x1,…, xk+1 ∈ Gk+1 for which simple commutator [x1, …, xk+1] equal to identity. In this paper we study versions an infinite G, with degree nilpotence defined by sampling in various natural ways, such as random walk, or Følner sequence if amenable. our first main result show that finitely generated, then positive and only virtually nilpotent (Theorem 1.5). This generalises both earlier second author treating case k = 1 Shalev groups, uses techniques from these results. We also show, using notion polynomial mappings groups developed Leibman others, large extent does not depend on method 1.12). As part argument generalise showing ϕ mapping into torsion-free group, set roots sparse certain sense 5.1). consider where residually but necessarily generated. Here quotients uniformly bounded below, 1.19), answering question Shalev. proof sub-multiplicative respect 1.21), generalising Gallagher.
منابع مشابه
Probabilistic Normed Groups
In this paper, we introduce the probabilistic normed groups. Among other results, we investigate the continuityof inner automorphisms of a group and the continuity of left and right shifts in probabilistic group-norm. We also study midconvex functions defined on probabilistic normed groups and give some results about locally boundedness of such functions.
متن کاملMazur-Ulam theorem in probabilistic normed groups
In this paper, we give a probabilistic counterpart of Mazur-Ulam theorem in probabilistic normed groups. We show, under some conditions, that every surjective isometry between two probabilistic normed groups is a homomorphism.
متن کاملA Testing Nilpotence of Galois Groups in Polynomial Time
We give the first polynomial-time algorithm for checking whether the Galois group Gal (f) of an input polynomial f(X) ∈ Q[X] is nilpotent: the running time of our algorithm is bounded by a polynomial in the size of the coefficients of f and the degree of f . Additionally, we give a deterministic polynomial-time algorithm that, when given as input a polynomial f(X) ∈ Q[X] with nilpotent Galois g...
متن کاملA relation between infinite subsets and exterior center in groups
Let G be a group. Neumann to answer a question of Paul Erdos proved that every infinite subset of G has two different comuting elements if and only if G is center-by-finite. In this paper, we deal with Erdoschr('39')s question in different aspect and we show that every infinite subset X of G has two different elements x and y such that x^y=1 if and only if the exterior center of G ihas finit...
متن کاملBrauer pairs of Camina p - groups of nilpotence class 2
In this paper, we find a condition that characterizes when two Camina p-groups of nilpotence class 2 form a Brauer pair. MSC primary: 20C15
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2021
ISSN: ['1565-8511', '0021-2172']
DOI: https://doi.org/10.1007/s11856-021-2168-3